Locating Diametral Points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locating charging points for an electric fleet

Centrale OO is a pioneering project aiming to deploy in Paris a fleet of 100 % electric taxis. The significant initial investment and the current restricted vehicle autonomy give a high relevancy to the charging terminal location task. This task can be seen as a variant of the well-known capacitated covering location problem (CCLP). A mixed integer programming model suiting the features of the ...

متن کامل

Locating good points for multivariate polynomial approximation

Locating good points for multivariate polynomial approximation, in particular interpolation, is an open challenging problem, even in standard domains. One set of points that is always good, in theory, is the so-called Fekete points. They are defined to be those points that maximize the (absolute value of the) Vandermonde determinant on the given compact set. However, these are known analyticall...

متن کامل

Locating faulty code by multiple points slicing

Dynamic slicing has long been considered as a useful tool for debugging programs as it effectively identifies a reduced fault candidate set which captures the faulty code in the program. Traditionally, a backward dynamic slice is computed starting from an incorrect value observed by the programmer during a failed program run. This incorrect value is either an incorrect output value or an incorr...

متن کامل

Locating Critical Points in 3D Vector Fields using Graphics Hardware

Calculating critical points in 3D vector fields is computationally expensive, and requires parameter adjustments to maximize the number and type of critical points found in a particular 3D vector field. This paper details the modifications required to execute Greene’s bisection method directly on graphics hardware, and compares the performance of the CPU+GPU versions to the CPU only versions.

متن کامل

Locating Natural Superconvergent Points of Finite Element Methods in 3d

In [20], we analytically identified natural superconvergent points of function values and gradients for several popular three-dimensional polynomial finite elements via an orthogonal decomposition. This paper focuses on the detailed process for determining the superconvergent points of pentahedral and tetrahedral elements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Results in Mathematics

سال: 2020

ISSN: 1422-6383,1420-9012

DOI: 10.1007/s00025-020-01193-5